Minimal Belief Change and Pareto-Optimality

نویسنده

  • Oliver Schulte
چکیده

This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a notion of minimal belief change, for two different representations of belief: First, for beliefs represented by a theory–a deductively closed set of sentences or propositions–and second for beliefs represented by an axiomatic base for a theory. Three postulates exactly characterize Pareto-minimal revisions of theories, yielding a weaker set of constraints than the standard AGM postulates. The Levi identity characterizes Pareto-minimal revisions of belief bases: a change of belief base is Pareto-minimal if and only if the change satisfies the Levi identity (for “maxichoice” contraction operators). Thus for belief bases, Pareto-minimality imposes constraints that the AGM postulates do not.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal belief change, Pareto-optimality and logical consequence

A rational agent changes her beliefs in response to new information; a widely held idea is that such belief changes should be minimal. This paper is an overview of the theory of minimal belief revision. I employ a decisiontheoretic framework to compare various principles for minimal belief revision. The main topics covered include the AGM postulates for belief revision, belief contraction, Grov...

متن کامل

Minimal Belief Change and the Pareto Principle

This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decision-theoretic principle of Pareto-optimality to derive a notion of minimal belief change, for two different representations of belief: First, for beliefs represented by a theory–a deductively closed set of sentences or propositions–and second for beliefs represented by an ax...

متن کامل

Solution of Multi-Objective optimal reactive power dispatch using pareto optimality particle swarm optimization method

For multi-objective optimal reactive power dispatch (MORPD), a new approach is proposed where simultaneous minimization of the active power transmission loss, the bus voltage deviation and the voltage stability index of a power system are achieved. Optimal settings of continuous and discrete control variables (e.g. generator voltages, tap positions of tap changing transformers and the number of...

متن کامل

Optimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone

In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.

متن کامل

The Logic of Bargaining

This paper reexamines the game-theoretic bargaining theory from logic and Artificial Intelligence perspectives. We present an axiomatic characterization of the logical solutions to bargaining problems. A bargaining situation is described in propositional logic with numerical representation of bargainers’ preferences. A solution to the n-person bargaining problems is proposed based on the maxmin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999